A hybrid type system for lock-freedom of mobile processes
نویسندگان
چکیده
منابع مشابه
A Type System for Lock-Free Processes
Interpretation. An alternative way to analyze the behavior of a concurrent program would be to use abstract interpretation [4, 5]. Actually, from a very general viewpoint, our type-based analysis of locks can be seen as a kind of abstract interpretation. We can read a type judgment Γ ⊢ P as “Γ is an abstraction of a concrete process P .” (The relation “⊢” corresponds to a pair of abstraction/co...
متن کاملDesign of an anti-lock regenerative braking system for a series hybrid electric vehicle
In this paper, an adaptive rule based controller for an anti-lock regenerative braking system (ARBS) of a series hybrid electric bus (SHEB) has been proposed. The proposed controller integrates the regenerative braking and wheel anti-lock functions by controlling the electric motor of the hybrid vehicle, without using any conventional mechanical anti-lock braking system. The performance of the ...
متن کاملYet Another Type System for Lock-Free Processes
A network of processes is lock free if every message produced in it is eventually consumed and if every process waiting for a message eventually receives one. We study a type system guaranteeing that well-typed process networks are lock free. Despite its minimality, our type system subsumes existing type-based approaches for lock freedom. In particular, we show that interactions whose lock free...
متن کاملA Type System for Unstructured Locking that Guarantees Deadlock Freedom without Imposing a Lock Ordering
Deadlocks occur in concurrent programs as a consequence of cyclic resource acquisition between threads. In this paper we present a novel type system that guarantees deadlock freedom for a language with references, unstructured locking primitives, and locks which are implicitly associated with references. The proposed type system does not impose a strict lock acquisition order and thus increases...
متن کاملA Type System for Lock-Free Processes1
Interpretation. An alternative way to analyze the behavior of a concurrent program would be to use abstract interpretation [4, 5]. Actually, from a very general viewpoint, our type-based analysis of locks can be seen as a kind of abstract interpretation. We can read a type judgment Γ P as “Γ is an abstraction of a concrete process P .” (The relation “ ” corresponds to a pair of abstraction/conc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 2010
ISSN: 0164-0925,1558-4593
DOI: 10.1145/1745312.1745313